Pseudorandomness

نویسنده

  • Oded Goldreich
چکیده

We postulate that a distribution is pseudorandom if it cannot be told apart from the uniform distribution by any eecient procedure. This yields a robust deenition of pseudorandom generators as eecient deterministic programs stretching short random seeds into longer pseudorandom sequences. Thus, pseudorandom generators can be used to reduce the randomness-complexity in any eecient procedure. Pseudorandom generators and computational diiculty are closely related: loosely speaking, each can be eeciently transformed into the other.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pseudorandomness Analysis of the Lai-Massey Scheme

At Asiacrypt’99, Vaudenay modified the structure in the IDEA cipher to a new scheme, which they called as the Lai-Massey scheme. It is proved that 3-round Lai-Massey scheme is sufficient for pseudorandomness and 4-round Lai-Massey scheme is sufficient for strong pseudorandomness. But the author didn’t point out whether three rounds and four rounds are necessary for the pseudorandomness and stro...

متن کامل

Pseudorandomness against Depth-2 Circuits and Analysis of Goldreich's Candidate One-Way Function

Pseudorandomness against Depth-2 Circuits and Analysis of Goldreich’s Candidate One-Way Function

متن کامل

On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol

On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol by Christian Mauduit (Marseille) and András Sárközy (Budapest) 1. Introduction. In the last 60 years numerous papers have been written on pseudorandom sequences (we shall also write PR for pseudoran-domness). In these papers a wide range of goals, approaches, and tools is presented; even the concept of "...

متن کامل

Measures of pseudorandomness of finite binary lattices , I ( The measures Q k , normality . )

In an earlier paper Hubert, Mauduit and Sárközy defined the notion of binary lattice, they introduced the measures of pseudorandomness of binary lattices, and they constructed a binary lattice with strong pseudorandom properties with respect to these measures. Later further constructions of this type have been given by different authors. In this series we will study the measures of pseudorandom...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000